-
Notifications
You must be signed in to change notification settings - Fork 241
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Add Burstedde Weighted BFBT test #6123
Conversation
98fb116
to
f48653b
Compare
tests/burstedde_bfbt.prm
Outdated
@@ -0,0 +1,105 @@ | |||
# The 3D polynomial Stokes (burstedde) benchmark, for which an |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
can you change the comment to read "test burstedde benchmark using BFBT preconditioner", remove all the other comments here, include the burstedde.prm from the benchmarks folder and only include the relevant sections here (mesh refinement and solver settings).
you will need to update test results once again |
764a66a
to
4565bbf
Compare
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I am ok with merging this to have a test for the bfbt schur complement preconditioner, but just to document this for the future: At the moment the bfbt version requires 159 outer GMRES iterations and the simple inverse viscosity mass matrix requires only 18 outer GMRES iterations. To compute this I used the same parameter file you have here inside the tester docker container, but with set Use weighted BFBT for Schur complement = false
. In other words either the method doesnt work very well for this benchmark, or there is something wrong in the method implementation. Did I interpret this correctly?
From all the tests I have run, AMG-BFBT can take quite a lot of iterations to converge when the number of initial global refinements is small. If you start with four initial global refinements, AMG takes 18 iterations and AMG-BFBT takes 73. For five levels, |
Thanks for confirming. However, is this a state you would expect? From my understanding BFBT was supposed to be a better approximation to the real Schur complement than the inverse mass matrix and therefore should reduce the number of outer GMRES iterations. Did you find a theoretical reason why it is worse? |
Yes, we are aware. I asked him to open PRs to add tests so we can document the current status and can correctly track progress. In short: we do not implement the corrections mentioned in the original paper for coarse meshes and I suspect our inner solver is not done correctly either. |
This pull request adds a test using weighted BFBT (with Stokes solver type = block AMG).